A super-junction SOI-LDMOS with low resistance electron channel

A novel super-junction LDMOS with low resistance channel(LRC), named LRC-LDMOS based on the silicon-oninsulator(SOI) technology is proposed. The LRC is highly doped on the surface of the drift region, which can significantly reduce the specific on resistance(Ron,sp) in forward conduction. The charge compensation between the LRC, N-pillar,and P-pillar of the super-junction are adjusted to satisfy the charge balance, which can completely deplete the whole drift,thus the breakdown voltage(BV) is enhanced in reverse blocking. The three-dimensional(3 D) simulation results show that the BV and R_(on,sp) of the device can reach 253 V and 15.5 mΩ·cm~2, respectively, and the Baliga's figure of merit(FOM = BV~2/R_(on,sp)) of 4.1 MW/cm~2 is achieved, breaking through the silicon limit.     

Palladium‐catalyzed decarboxylative coupling of α,β‐unsaturated carboxylic acids with aryl tosylates

We report a general method for selective cross‐coupling of α,β‐unsaturated carboxylic acids with aryl tosylates enabled by versatile Pd(II) complexes. This method features the general cross‐coupling of ubiquitous α,β‐unsaturated carboxylic acids by decarboxylation. The transformation is characterized by its operational simplicity, the use of inexpensive, air‐stable Pd(II) catalysts, scalability and wide substrate scope. The reaction proceeds with high trans selectivity to furnish valuable (E)‐1,2‐diarylethenes.     

Infinite family of transmission irregular trees of even order

Distance between two vertices is the number of edges in a shortest path connecting them in a connected graph $G$. The transmission of a vertex $v$ is the sum of distances from $v$ to all the other vertices of $G$. If transmissions of all vertices are mutually distinct, then $G$ is a transmission irregular graph. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klav?ar (2018). The following problem was posed in Alizadeh and Klav?ar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed.     

Gallai’s path decomposition conjecture for graphs of small maximum degree

Gallai’s path decomposition conjecture states that the edges of any connected graph on $n$ vertices can be decomposed into at most $\frac{n+1}{2}$ paths. We confirm that conjecture for all graphs with maximum degree at most five.     

Exploring mathematical connections of pre-university students through tasks involving rates of change

This paper reports the results of a research exploring the mathematical connections of pre-university students while they solving tasks which involving rates of change. We assume mathematical connections as a cognitive process through which a person finds real relationships between two or more ideas, concepts, definitions, theorems, procedures, representations or meanings or with other disciplines or the real-world. Four tasks were proposed to the 33 pre-university students that participated in this research; the central concept of the first task is the slope, the last three tasks contain concepts like velocity, speed and acceleration. Task-based interviews were conducted to collect data and later analysed with thematic analysis. Results showed most of the students made mathematical connections of the procedural type, the mathematical connections of the common features type are made in smaller quantities and the mathematical connection of the generalization type is scarcely made. Furthermore, students considered slope as a concept disconnected from velocity, speed and acceleration.     

The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.